- eight queens problem
- 八皇后问题，九宫问题
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
eight queens problem
Look at other dictionaries:
Eight queens puzzle — a b c d e f g h … Wikipedia
Eight queens puzzle solutions — This article shows algorithmic solutions to the eight queens puzzle implemented in various computer programming languages. For specific outcomes of these algorithms, see the main eight queens puzzle article.Board representations* The naive… … Wikipedia
Chess problem — Part of a series on Puzzles … Wikipedia
Mathematical chess problem — is a mathematical problem which is formulated using chessboard or chess pieces. These problems belong to recreational mathematics. The most known problems of this kind are Eight queens puzzle or Knight s Tour problems, which have connection to… … Wikipedia
Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… … Wikipedia
List of The King of Queens episodes — This is a list of episodes for the television show The King of Queens that first aired on September 21, 1998 Contents 1 Overview 2 List of episodes 2.1 Season 1: 1998–1999 2.2 … Wikipedia
Brute-force search — In computer science, brute force search or exhaustive search, also known as generate and test, is a trivial but very general problem solving technique that consists of systematically enumerating all possible candidates for the solution and… … Wikipedia
number game — Introduction any of various puzzles and games that involve aspects of mathematics. Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… … Universalium
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
Min-conflicts algorithm — The min conflicts algorithm is a search algorithm to solve constraint satisfaction problems (CSP problems). It assigns random values to all the variables of a CSP. Then it selects randomly a variable, whose value conflicts with any constraint of… … Wikipedia
Magic square — In recreational mathematics, a magic square of order n is an arrangement of n2 numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant.[1] A normal magic… … Wikipedia
